package p800;

/**
 * @author pengjz <br>
 * @version 1.0 <br>
 * @description Leetcode_887 <br>
 * @date 2021/12/27 17:32 <br>
 */
public class Leetcode_887 {
    public int superEggDrop(int K, int N) {
        int[] dp = new int[K + 1];
        int m = 0;
        while (dp[K] < N) {
            for (int i = K; i >= 1; i--) {
                dp[i] += dp[i - 1] + 1;
            }
            m++;
        }
        return m;
    }

    public static void main(String[] args) {
    }
}
